The Second King’s Workshop on Random Graphs and Random Processes
ثبت نشده
چکیده
منابع مشابه
Coalescing Random Walks and Voting on Connected Graphs
In a coalescing random walk, a set of particles make independent discrete-time random walks on a graph. Whenever one or more particles meet at a vertex, they unite to form a single particle, which then continues a random walk through the graph. Let G = (V,E), be an undirected and connected graph, with n vertices and m edges. The coalescence time, C(n), is the expected time for all particles to ...
متن کاملRobust Control Synchronization on Multi-Story Structure under Earthquake Loads and Random Forces using H∞ Algorithm
In this paper, the concept of synchronization control along with robust H∞ control are considered to evaluate the seismic response control on multi-story structures. To show the accuracy of the novel algorithm, a five-story structure is evaluated under the EL-Centro earthquake load. In order to find the performance of the novel algorithm, random and uncertainty processes corresponding...
متن کاملNew Perspectives in Stochastic Geometry 2657 Workshop : New Perspectives in Stochastic Geometry
The workshop was devoted to the discussion and exploration of recent developments in stochastic geometry. Two main themes were new results and methodology in classical stochastic geometry and allocation and matching procedures for point processes and random measures. Mathematics Subject Classification (2000): 60xx, 51xx. Introduction by the Organisers The principal aim of stochastic geometry is...
متن کاملThe Cover Times of Random Walks on Hypergraphs
Random walks in graphs have been applied to various network exploration and networkmaintenance problems. In some applications, however, it may be more natural, and moreaccurate, to model the underlying network not as a graph but as a hypergraph, and solutionsbased on random walks require a notion of random walks in hypergraphs. While randomwalks in graphs have been extensive...
متن کاملParallel dynamics of disordered Ising spin systems on finitely connected random graphs
J P L Hatchett, B Wemmenhove, I Pérez Castillo, T Nikoletopoulos, N S Skantzos and A C C Coolen † Department of Mathematics, King’s College London, The Strand, London WC2R 2LS, United Kingdom ¶ Institute for Theoretical Physics, University of Amsterdam, Valckenierstraat 65, 1018 XE Amsterdam, The Netherlands ‡ Institute for Theoretical Physics, Katholieke Universiteit Leuven, Celestijnenlaan 20...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2018